Nondeterministic finite automaton - PDFSEARCH.IO - Document Search Engine

Nondeterministic finite automaton
Results: 144

#	Item
101	Probabilistic Cost Enforcement of Security Policies Yannis Mallios1 , Lujo Bauer1 , Dilsun Kaynar1 , Fabio Martinelli2 , and Charles Morisset3 1 2 Add to Reading List Source URL: www.ece.cmu.edu Language: English - Date: 2013-08-04 12:37:28 Models of computation Probability theory Boolean algebra Measure theory Sigma-algebra Parity of a permutation Finite-state machine Nondeterministic finite automaton Mathematics Automata theory Mathematical analysis
102	1 Automata Theory Program file for this chapter: fsm Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2003-12-25 20:47:48 Theoretical computer science Computer science Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Abstract machine Formal language State diagram State Models of computation Theory of computation Automata theory
103	International Journal of Foundations of Computer Science c World Scientific Publishing Company The Design Principles and Algorithms of a Weighted Grammar Library Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:35 Computer science Applied mathematics Finite-state machine Finite state transducer Deterministic finite automaton Nondeterministic finite automaton N-gram Algorithm Speech recognition Automata theory Models of computation Theoretical computer science
104	A General Weighted Grammar Library Cyril Allauzen1 , Mehryar Mohri2 , and Brian Roark3? 1 AT&T Labs – Research 180 Park Avenue, Florham Park, NJ[removed] Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:31 Models of computation Computer science Finite state transducer Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Context-free grammar Powerset construction Regular expression Automata theory Formal languages Theoretical computer science
105	A General Weighted Grammar Library Cyril Allauzen, Mehryar Mohri, and Brian Roark AT&T Labs – Research, Shannon Laboratory 180 Park Avenue, Florham Park, NJ[removed] {allauzen, mohri, roark}@research.att.com http://w Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-11-02 10:14:30 Models of computation Computer science Software engineering Finite state transducer Finite-state machine Nondeterministic finite automaton Deterministic finite automaton Context-free grammar Powerset construction Automata theory Formal languages Theoretical computer science
106	Distribution Kernels Based on Moments of Counts [removed] Corinna Cortes Google Labs, 1440 Broadway, New York, NY 10018 Add to Reading List Source URL: www.machinelearning.org Language: English - Date: 2008-12-01 11:20:00 Models of computation Mathematics Science Natural language processing Probability theory Finite state transducer String kernel Nondeterministic finite automaton Regular language Automata theory Formal languages Statistics
107	Graph Logics with Rational Relations: The Role of Word Combinatorics Pablo Barcel´o Pablo Mu˜noz Add to Reading List Source URL: ciws.cl Language: English - Date: 2014-05-04 09:47:46 Combinatorics on words Theoretical computer science Structure Universal algebra Model theory Regular language String Nondeterministic finite automaton Admissible rule Formal languages Mathematics Automata theory
108	COMS W3261: Computer Science Theory Class time: Tuesdays and Thursdays 2:40 - 3:55 PM Class location: MUDD 833 Instructor: Allison Lewko Office hours for Instructor: Tuesdays 10:00 AM - 12:00 PM in CSB 519 Add to Reading List Source URL: www.cs.columbia.edu Language: English - Date: 2014-02-27 18:24:23 Formal languages Applied mathematics Mathematics Theory of computation Computability Deterministic finite automaton Nondeterministic finite automaton Finite-state machine Complexity class Automata theory Models of computation Theoretical computer science
109	Symposium on Theoretical Aspects of Computer Science[removed]Bordeaux), pp[removed]www.stacs-conf.org EFFICIENT MINIMIZATION OF DFAS WITH PARTIAL TRANSITION FUNCTIONS ANTTI VALMARI Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2008-02-05 08:15:37 DFA minimization Nondeterministic finite automaton Symbol Mathematics Computing Logic Büchi automaton Automata theory Models of computation Deterministic finite automaton
110	Lecture notes on automata, languages, and grammars Cristopher Moore January 11, 2013 Abstract These lecture notes are intended as a supplement to Moore and Mertens’ The Nature of Computation, and are available to anyon Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2013-01-11 13:28:25 Applied mathematics Nondeterministic finite automaton Myhill–Nerode theorem DFA minimization Regular language Deterministic finite automaton Regular expression Finite-state machine Powerset construction Automata theory Theoretical computer science Computer science

UPDATE